Search results for " DNA computing"

showing 2 items of 2 documents

A detailed experimental study of a DNA computer with two endonucleases

2017

Abstract Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro’s group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical operations, is its complexity – increasing the number of states of biomolecular automata. In this study, we constructed (in laboratory conditions) a six-state DNA computer that uses two endonucleases (e.g. AcuI and BbvI) and a ligase. We have presented a detailed experimental verification of its feasibility. We described the effe…

0301 basic medicineTheoretical computer scienceDNA LigasesComputer scienceCarry (arithmetic)Oligonucleotides0102 computer and information sciencesBioinformatics01 natural sciencesGeneral Biochemistry Genetics and Molecular Biologylaw.inventionAutomationComputers Molecular03 medical and health sciencesDNA computinglawA-DNADeoxyribonucleases Type II Site-Specificchemistry.chemical_classificationDNA ligaseFinite-state machineBase Sequencebiomolecular computers; DNA computing; finite automataProcess (computing)DNAModels TheoreticalEndonucleasesAutomaton030104 developmental biologychemistry010201 computation theory & mathematicsWord (computer architecture)Zeitschrift für Naturforschung C
researchProduct

Splicing Systems from Past to Future: Old and New Challenges

2014

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Formal Languages and Automata Theory (cs.FL)Splicing Systems Formal Languages.ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting SystemsComputer Science - Formal Languages and Automata TheorySplicing Systems Formal languages Regular languages DNA computingComputingMilieux_MISCELLANEOUS[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science - Discrete Mathematics
researchProduct